An algorithm to test the conflict preorder

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hierarchical interface-based supervisory control using the conflict preorder

Hierarchical Interface-Based Supervisory Control decomposes a large discrete event system into subsystems linked to each other by interfaces, facilitating the design of complex systems and the re-use of components. By ensuring that each subsystem satisfies its interface consistency conditions locally, it can be ensured that the complete system is controllable and nonblocking. The interface cons...

متن کامل

A State-Based Characterisation of the Conflict Preorder

This paper proposes a way to effectively compare the potential of processes to cause conflict. In discrete event systems theory, two concurrent systems are said to be in conflict if they can get trapped in a situation where they are both waiting or running endlessly, forever unable to complete their common task. The conflict preorder is a process-algebraic pre-congruence that compares two proce...

متن کامل

A Preorder Classiication Algorithm Based on a Poset Classiication Algorithm

This work shows how any classiication system based on orders may be extended to pre-orders. Such systems build hierarchies of object representations with a strict ordering relation between them and do not provide for the retention of multiple logically equivalent representations. In some domains retention of equivalent representations is required-this arises for example when integrating knowled...

متن کامل

A novel algorithm to determine the leaf (leaves) of a binary tree from its preorder and postorder traversals

Binary trees are essential structures in Computer Science. The leaf (leaves) of a binary tree is one of the most significant aspects of it. In this study, we prove that the order of a leaf (leaves) of a binary tree is the same in the main tree traversals; preorder, inorder, and postorder. Then, we prove that given the preorder and postorder traversals of a binary tree, the leaf (leaves) of a bi...

متن کامل

ترجمه و تحقیق کتاب an introduction to the history of mysticism

پایان نامه ی ارائه شده ترجمه ی کتاب «an introduction to the history of mysticism» نوشته ی مارگارت اسمیت که وی پژوهشگر، خاورشناس و محقق برجسته ی تصوف و عرفان می باشد. موضوع اساسی و مهم این کتاب عرفان در ادیان مختلف است. نویسنده در ابتدا این کلمه را ریشه یابی کرده و سپس تعریفی از آن ارائه داده و آن را در ادیان مختلف مورد بحث قرار داده است و در هر فصل کتاب به معرفی عرفای آن دین یا عصر خاصی پرداخته...

15 صفحه اول

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Science of Computer Programming

سال: 2014

ISSN: 0167-6423

DOI: 10.1016/j.scico.2013.09.006